A revision of recent approaches for two-dimensional strip-packing problems
نویسندگان
چکیده
In this paper, we present a review of the recent approaches proposed in the literature for strip-packing problems. Many of them have been concurrently published, given some similar results for the same set of benchmarks. Due to the quantity of published papers, it is difficult to ascertain the level of current research in this area. & 2008 Published by Elsevier Ltd.
منابع مشابه
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملSymmetry breaking generalized disjunctive formulation for the strip packing problem
The two-dimensional strip packing is a special case of “Cutting and Packing” problems that arises in many applications. The problem seeks to pack a given set of rectangles into a strip of given width in order to minimize its length. Some applications in which the strip packing problem arises are: Cutting pieces from wooden boards, cutting pieces from glass or steel sheets, optimal layout of ind...
متن کاملInvited Review Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems these units are finite rectangles, and the objective is to pack all the items into the minimum number of units, while in two-dimensional strip packing problems there is a single standardized unit of given width, and the o...
متن کاملA New Search Procedure for the Two-dimensional Orthogonal Packing Problem
In this paper we propose a new exact procedure for the two-dimensional orthogonal packing problem, based on F. Clautiaux et al. approach [4]. The principle consists in searching first the positions of the items on the horizontal axis, so as that, at each position, the sum of the heights of the items does not exceed the height of the bin. Each time a valid placement of all the items is encounter...
متن کاملApproximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eng. Appl. of AI
دوره 22 شماره
صفحات -
تاریخ انتشار 2009